Strong Edge Coloring of K4(t)-Minor Free Graphs
نویسندگان
چکیده
A strong edge coloring of a graph G is proper edges in such that any two distance at most 2 are colored with distinct colors. The chromatic index χs′(G) the smallest integer l admits using K4(t)-minor free does not contain K4(t) as contraction subgraph, where obtained from K4 by subdividing exactly t−4 times. paper shows every maximum degree Δ(G) has χs′(G)≤(t−1)Δ(G) for t∈{5,6,7} which generalizes some known results on K4-minor graphs Batenburg, Joannis de Verclos, Kang, Pirot 2022 and Wang, Wang 2018. These upper bounds sharp.
منابع مشابه
Edge-coloring Vertex-weightings of Graphs
Let $G=(V(G),E(G))$ be a simple, finite and undirected graph of order $n$. A $k$-vertex weightings of a graph $G$ is a mapping $w: V(G) to {1, ldots, k}$. A $k$-vertex weighting induces an edge labeling $f_w: E(G) to N$ such that $f_w(uv)=w(u)+w(v)$. Such a labeling is called an {it edge-coloring k-vertex weightings} if $f_{w}(e)not= f_{w}(echr(chr(chr('39')39chr('39'))39chr(chr('39')39chr('39'...
متن کاملPerfection for strong edge-coloring on graphs
A strong edge-coloring of a graph is a function that assigns to each edge a color such that every two distinct edges that are adjacent or adjacent to a same edge receive different colors. The strong chromatic index χs(G) of a graph G is the minimum number of colors used in a strong edge-coloring of G. From a primal-dual point of view, there are three natural lower bounds of χs(G), that is σ(G) ...
متن کاملStrong edge-coloring for jellyfish graphs
A strong edge-coloring of a graph is a function that assigns to each edge a color such that two edges within distance two apart receive different colors. The strong chromatic index of a graph is the minimum number of colors used in a strong edge-coloring. This paper determines strong chromatic indices of cacti, which are graphs whose blocks are cycles or complete graphs of two vertices. The pro...
متن کاملStrong edge-coloring for cubic Halin graphs
A strong edge-coloring of a graph G is a function that assigns to each edge a color such that two edges within distance two apart must receive different colors. The minimum number of colors used in a strong edge-coloring is the strong chromatic index of G. Lih and Liu [14] proved that the strong chromatic index of a cubic Halin graph, other than two special graphs, is 6 or 7. It remains an open...
متن کاملList-coloring apex-minor-free graphs
A graph H is t-apex if H − X is planar for some set X ⊂ V (H) of size t. For any integer t ≥ 0 and a fixed t-apex graph H, we give a polynomial-time algorithm to decide whether a (t + 3)-connected Hminor-free graph is colorable from a given assignment of lists of size t+4. The connectivity requirement is the best possible in the sense that for every t ≥ 1, there exists a t-apex graph H such tha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Axioms
سال: 2023
ISSN: ['2075-1680']
DOI: https://doi.org/10.3390/axioms12060556